Schinzel's conjecture H and divisibility in abelian linear recurring sequences

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

non-divisibility for abelian groups

Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting   all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...

متن کامل

Divisibility Tests and Recurring Decimals in Euclidean Domains

In this article, we try to explain and unify standard divisibility tests found in various books. We then look at recurring decimals, and list a few of their properties. We show how to compute the number of digits in the recurring part of any fraction. Most of these results are accompanied by a proof (along with the assumptions needed), that works in a Euclidean domain. We then ask some question...

متن کامل

Primes in Divisibility Sequences

We give an overview of two important families of divisibility sequences: the Lehmer–Pierce family (which generalise the Mersenne sequence) and the elliptic divisibility sequences. Recent computational work is described, as well as some of the mathematics behind these sequences.

متن کامل

Equidistribution of Linear Recurring Sequences in Finite Fields

According to a general principle established by the first author [ 121, any linear recurring sequence in a finite field which hes a sufficiently long period is almost equidistributed, in the sense that each element of the field occurs about equally often in the full period of the sequence. This raises the question of characterizing those linear recurring sequences for which we have exact equidi...

متن کامل

Strong divisibility and lcm-sequences

Let R be an integral domain in which every two nonzero elements have a greatest common divisor. Let (an)n>1 be a sequence of nonzero elements in R. We prove that gcd(an, am) = agcd(n,m) for all n,m > 1 if and only if an = ∏

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1990

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-59-1-1-7